A New Low Complexity Optimal Decoding Method for MIMO Systems
نویسندگان
چکیده
A method is proposed to reduce the complexity of ML decoding for MIMO systems based on PSK constellation with two transmit antennas. We use the feature that the points of a PSK constellation form a finite group under complex multiplication to substantially reduce the decoding complexity. The proposed method of decoding is used for both BLAST systems and a new full-rate full-diversity space-time code. The proposed space-time code offers a high coding advantage and at the same time allows for a simple decoding algorithm.
منابع مشابه
Soft-Input Soft-Output Single Tree-Search Sphere Decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for practical receiver implementations, in particular in the context of multiple-input multiple-output (MIMO) wireless communication systems. In this paper, we present a low-complexity SISO sphere-decoding algorithm, based on...
متن کاملAnalysis of a fixed-complexity sphere decoding method for Spatial Multiplexing MIMO
A new detection algorithm for decoding multiple-input multiple-output (MIMO) transmission is proposed and analyzed. The method is based on combining sphere decoding (SD) and zero forcing (ZF) techniques. The proposed method performs a fixed number of operations to detect the signal, independent of the noise level, and hence provides a fixed complexity near optimal performance. The algorithm is ...
متن کاملApproximate maximum a posteriori detection for multiple-input-multiple-output systems with bit-level lattice reduction-aided detectors and successive interference cancellation
For iterative detection and decoding (IDD) in multiple-input–multiple-output (MIMO) systems, although the maximum a posteriori (MAP) detector can achieve an optimal performance, because of its prohibitively high computational complexity, various low-complexity approximate MAP detectors are studied. Among the existing MIMO detectors for the non-IDD receivers, lattice reduction (LR)-aided detecto...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل